International Journal of Advanced Networking and Applications

Uttam Kr. Mondal ¹, Satyendra Nath Mandal ², J. Pal Choudhury ², J. K. Mandal ³

Affiliations
1 Dept. of CSE & IT, College of Engg. & Management, Kolaghat , Midnapur (W.B), IN
2 Dept. of IT, Kalyani Govt. Engg. College, Kalyani, Nadia (W.B), IN
3 Dept. of CSE, University of Kalyani, Nadia (W.B), IN

Abstract

There are huge numbers of algorithms available in symmetry key block cipher. All these algorithms have been used either complicated keys to produce cipher text from plain text or a complicated algorithms for it. The level of security of all algorithms is dependent on either number of iterations or length of keys. In this paper, a symmetry key block cipher algorithm has been proposed to encrypt plain text into cipher text or vice versa using a frame set. A comparative study have been made with RSA, DES, IDEA, BAM and other algorithms with Chi-square value, frequency distribution, bit ratio to check the security level of proposed algorithm. Finally, a comparison has been made for time complexity for encryption of plain text and decryption from cipher text with the well-known existing algorithms.

Keywords

Cryptography, Plain Text, Cipher Text, Symmetric Key Algorithm, Chi-Square and Frequency Distributions.

Full Text

   

Satyendra Nath Mandal ¹, Kumarjit Banerjee ², Biswajit Maiti ³, J. Palchaudhury ¹

Affiliations
1 Dept. of I.T, Kalyani Govt. Engg College, Kalyani, Nadia (W.B), IN
2 CSE, Kalyani Govt. Engg College, Kalyani, Nadia (W.B), IN
3 Dept. of Mathmatics, Kalyani Govt. Engg College, Kalyani, Nadia (W.B), IN

Abstract

The RSA cryptosystem, invented by Ron Rivest, Adi Shamir and Len Adleman was first published in the August 1978 issue of ACM. The cryptosystem is most commonly used for providing priva cy and ensuring authenticity of digital data. The security level of this algorithm depends on chooing two large prime numbers. But, to handle large prime in personal computer is huge time consuming. Further, each and every compiler has a maximum limit to integer handling capability. In this paper, an approach has been made to modify trial division technique for implementation of RSA algorithm for large numbers beyond the range of a compiler that has been used to implement it. The time complexity of this modified trial division method has been calculated using personal computer, at the end for large integer.

Keywords

RSA Cryptosystem, Prime Number, Trail Division, Time Complexity.

Full Text